An Improved Public Key Encryption Algorithm Based on Chebyshev Polynomials

نویسندگان

  • Jinhui Sun
  • Geng Zhao
  • Xufei Li
چکیده

This paper proposes an improved public key encryption algorithm based on Chebyshev polynomials. On the base of the semi-group property of Chebyshev polynomials, we import the alternative multiply coefficient i K to forge the ciphertext tactfully which can make the cipher text-only aattack out of work. The chosen of i K is decided by the value of ( ( )) mod r s T T x N , and the number of i K can be chosen as required. Besides, The digital signature of the ciphertext not only can prevent the result from faking and tampering attack, but also can make the algorithm have the function of identity authentication. Experimental results and performance analyses show that the improved algorithm has much higher security and practical value.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameter Selection in Public Key Cryptosystem based on Chebyshev Polynomials over Finite Field

A recently proposed public key cryptosystem based on Chebyshev polynomials suggests a new approach to data encryption. But the security of the cryptosystem has not been investigated in depth, for lack of an appropriate analysis method. In this paper, a new representation of Chebyshev polynomial is introduced to study security issues of the cryptosystem. The properties of Chebyshev polynomial se...

متن کامل

QRKE: Extensions

Permutable Chebyshev polynomials (T polynomials) defined over the field of real numbers are suitable for creating a Diffie-Hellman-like key exchange algorithm that is able to withstand attacks using quantum computers. The algorithm takes advantage of the commutative properties of Chebyshev polynomials of the first kind. We show how T polynomial values can be computed faster and how the underlyi...

متن کامل

Security of public key cryptosystems based on Chebyshev Polynomials

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and ...

متن کامل

A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems

In this paper‎, two inverse problems of determining an unknown source term in a parabolic‎ equation are considered‎. ‎First‎, ‎the unknown source term is ‎estimated in the form of a combination of Chebyshev functions‎. ‎Then‎, ‎a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem‎. ‎For solving the problem‎, ‎the operational matrices of int...

متن کامل

Certificateless Public Key Encryption ( CL - PKE ) Scheme Using Extended Chebyshev Polynomial over the Finite Field

In this paper, we introduce a new alternative model for a Certificateless Public Key Encryption (CL-PKE) scheme. Our proposed CL-PKE scheme uses the Identity Based Encryption (IBE) scheme extended over the finite field p to generate its encryption and decryption keys. The proposed system is applicable, secure, and reliable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013